Euclid ’ s Algorithm Andrzej
نویسندگان
چکیده
The main goal of the paper is to prove the correctness of the Euclid’s algorithm for SCM. We define the Euclid’s algorithm and describe the natural semantics of it. Eventually we prove that the Euclid’s algorithm computes the Euclid’s function. Let us observe that the Euclid’s function is defined as a function mapping finite partial states to finite partial states of SCM rather than pairs of integers to integers.
منابع مشابه
Some Remarks on the Simple Concrete Model of Computer
We prove some results on SCM needed for the proof of the correctness of Euclid’s algorithm. We introduce the following concepts: starting finite partial state (Start-At(l)), then assigns to the instruction counter an instruction location (and consists only of this assignment), programmed finite partial state, that consists of the instructions (to be more precise, a finite partial state with the...
متن کاملEnhanced Euclid Algorithm for Modular Multiplicative Inverse and Its Application in Cryptographic Protocols
Numerous cryptographic algorithms (ElGamal, Rabin, RSA, NTRU etc) require multiple computations of modulo multiplicative inverses. This paper describes and validates a new algorithm, called the Enhanced Euclid Algorithm, for modular multiplicative inverse (MMI). Analysis of the proposed algorithm shows that it is more efficient than the Extended Euclid algorithm (XEA). In addition, if a MMI doe...
متن کاملDynamical Analysis of the Parametrized Lehmer-Euclid Algorithm
The Lehmer–Euclid Algorithm is an improvement of the Euclid Algorithm when applied to large integers. The original Lehmer–Euclid Algorithm replaces divisions on multi-precision integers by divisions on single-precision integers. Here we study a slightly different algorithm that replaces computations on n-bit integers by computations on μn-bit integers. This algorithm depends on the truncation d...
متن کاملAn Area-Efficient Euclid Architecture with Low Latency
This paper describes a new area-efficient Euclid Architecture with low latency based on the improvement of Euclid algorithm in Reed-Solomon (RS) decoding. The Euclid algorithm is improved by simplifying the process of data swap, which is needed in the original algorithm. Based on the improved algorithm, an area-efficient Euclid architecture with low latency is proposed, which can save time and ...
متن کاملBounded Domains and Unbounded Domains
First, notions of inside components and outside components are introduced for any subset of n-dimensional Euclid space. Next, notions of the bounded domain and the unbounded domain are defined using the above components. If the dimension is larger than 1, and if a subset is bounded, a unbounded domain of the subset coincides with an outside component (which is unique) of the subset. For a spher...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004